Multiplicativity-preserving arithmetic power series

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Complexity, Kleene Closure, and Formal Power Series

The aim of this paper is to use formal power series techniques to study the structure of small arithmetic complexity classes such as GapNC and GapL. More precisely, we apply the Kleene closure of languages and the formal power series operations of inversion and root extraction to these complexity classes. We define a counting version of Kleene closure and show that it is intimately related to i...

متن کامل

Corrigendum for Arithmetic Complexity, Kleene Closure, and Formal Power Series

Pierre McKenzie and Sambuddha Roy pointed out that the proof of statements (b) and (c) in Theorem 7.3 are buggy. The main flaw is that the identity e of the group F may not be the identity of the monoid, and so the claim that w ∈ (A F,r) * ⇐⇒ w ∈ Test does not work. In this corrigendum, we show: • With a slight change to Definition 7.1, the statement of Theorem 7.3 holds unchanged. In our opini...

متن کامل

Arithmetic hypergeometric series

The main goal of our survey is to give common characteristics of auxiliary hypergeometric functions (and their generalisations), functions which occur in number-theoretical problems. Originally designed as a tool for solving these problems, the hypergeometric series have become a connecting link between different areas of number theory and mathematics in general. Bibliography: 183 titles.

متن کامل

Parity-preserving transformations in computer arithmetic

Parity checking comprises a low-redundancy method for the design of reliable digital systems. While quite effective for detecting single-bit transmission or storage errors, parity encoding has not been widely used for checking the correctness of arithmetic results because parity is not preserved during arithmetic operations and parity prediction requires fairly complex circuits in most cases. W...

متن کامل

Estimation of Arithmetic Linear Series

In the paper [5], Lazarsfeld and Mustaţă propose general and systematic usage of Okounkov’s idea in order to study asymptotic behavior of linear series on an algebraic variety. It is a very simple way, but it yields a lot of consequences, like Fujita’s approximation theorem. Yuan [8] generalized this way to the arithmetic situation, and he established the arithmetic Fujita’s approximation theor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1974

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1974.55.277